Decomposing modular tensor products: ‘Jordan partitions’, their parts and p-parts
نویسندگان
چکیده
منابع مشابه
A note on partitions into distinct parts and odd parts
Bousquet-Mélou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a well-known result by Euler. We give a different graphical interpretation of the bijection by Sylvester on partitions into distinct parts and partitions into odd parts, and show that the bijecti...
متن کاملParity Results for p-Regular Partitions with Distinct Parts
We consider the partition function bp(n), which counts the number of partitions of the integer n into distinct parts with no part divisible by the prime p. We prove the following: Let p be a prime greater than 3 and let r be an integer between 1 and p−1, inclusively, such that 24r + 1 is a quadratic nonresidue modulo p. Then, for all nonnegative integers n, bp(pn + r) ≡ 0 (mod 2).
متن کاملDistinct Parts Partitions without Sequences
Partitions without sequences of consecutive integers as parts have been studied recently by many authors, including Andrews, Holroyd, Liggett, and Romik, among others. Their results include a description of combinatorial properties, hypergeometric representations for the generating functions, and asymptotic formulas for the enumeration functions. We complete a similar investigation of partition...
متن کاملPartitions and Overpartitions with Attached Parts
We show how to interpret a certain q-series as a generating function for overpartitions with attached parts. A number of families of partition theorems follow as corollaries.
متن کاملHooks and Powers of Parts in Partitions
Many textbooks contain material on partitions. Two standard references are [A] and [S]. A partition of a natural integer n with parts λ1, . . . , λk is a finite decreasing sequence λ = (λ1 ≥ λ2 ≥ · · · ≥ λk > 0) of natural integers λ1, . . . , λk > 0 such that n = ∑k i=1 λi. We denote by |λ| the content n of λ. Partitions are also written as sums: n = λ1 + · · ·+ λk and one uses also the (abusi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2015
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-015-1217-1